Colloquium Complexity and robustness
نویسنده
چکیده
Highly optimized tolerance (HOT) was recently introduced as a conceptual framework to study fundamental aspects of complexity. HOT is motivated primarily by systems from biology and engineering and emphasizes, (i) highly structured, nongeneric, self-dissimilar internal configurations, and (ii) robust yet fragile external behavior. HOT claims these are the most important features of complexity and not accidents of evolution or artifices of engineering design but are inevitably intertwined and mutually reinforcing. In the spirit of this collection, our paper contrasts HOT with alternative perspectives on complexity, drawing on realworld examples and also model systems, particularly those from self-organized criticality.
منابع مشابه
Does robustness imply tractability? A lower bound for planted clique in the semi-random model
We consider a robust analog of the planted clique problem. In this analog, a set S of vertices is chosen and all edges in S are included; then, edges between S and the rest of the graph are included with probability 12 , while edges not touching S are allowed to vary arbitrarily. For this semi-random model, we show that the information-theoretic threshold for recovery is Θ̃( √ n), in sharp contr...
متن کاملThe Depth Irreducibility Hypothesis
We propose the following computational assumption: in general if we try to compress the depth of a circuit family (parallel time) more than a constant factor we will suffer super-quasipolynomial blowup in the size (number of processors). This assumption is only slightly stronger than the popular assumption about the robustness of NC, and we observe that it has surprising consequences. Note also...
متن کاملRound Complexity Versus Randomness Complexity in Interactive Proofs
Consider an interactive proof system for some set S that has randomness complexity r(n) for instances of length n, and arbitrary round complexity. We show a public-coin interactive proof system for S of round complexity O(r(n)/ log n). Furthermore, the randomness complexity is preserved up to a constant factor, and the resulting interactive proof system has perfect completeness. ∗Department of ...
متن کاملBlack-White Pebbling is PSPACE-Complete
The complexity of the Black-White Pebbling Game has remained an open problem for 30 years. It was devised to capture the power of non-deterministic space bounded computation. Since then it has been continuously studied and applied to problems in diverse areas of computer science including VLSI design and more recently propositional proof complexity. In 1983, determining its complexity was rated...
متن کامل